//链表的c++实现
//这里只实现一遍双向循环链表，功能相对来说比较强大，虽然占的内存也比较多，但是无所谓

#include "LinkedList.hpp"
#include <iostream>

int main(int argc, char** argv) {
   LinkedList* list1=new LinkedList;
   ListData data1={0,1};
   list1->PushFront(data1);
   list1->ShowData();
//    list1->PushFront(data1);
//    list1->ShowData();

   ListData* data2=list1->GetElem(1);
   data2->a=1;
   list1->ShowData();
    return 0;
}
